Improved Resampling Algorithms Based on Deterministic and Partial Resampling
نویسندگان
چکیده
منابع مشابه
Resampling and its Avoidance in Genetic Algorithms
Genetic algorithms are widely used as optimization and adaptation tools, and they became important in artiicial intelligence. Even though several successful applications have been reported, recent research has identiied some ineeciencies in genetic algorithm performance. This paper argues that the degradation of genetic algorithm performance originates from the random application of the variati...
متن کاملWavelet Based Texture Resampling
The integral equation arising from space variant 2-D texture res-ampling is reformulated through wavelet analysis. We transform the standard convolution integral in texture space into an inner product over sparse representations for both the texture and the warped lter function. This yields an algorithm that operates in constant time in the area of the domain of convolution, and that is sensiti...
متن کاملPartial Resampling to Approximate Covering Integer Programs
We consider column-sparse positive covering integer programs, which generalize set cover and which have attracted a long line of research developing (randomized) approximation algorithms. We develop a new rounding scheme based on the Partial Resampling variant of the Lovász Local Lemma developed by Harris & Srinivasan (2013). This achieves an approximation ratio of 1 + ln(∆1+1) amin +O( √ log(∆...
متن کاملParticle Filter Based Vehicle Tracking Approach with Improved Resampling Stage
Optical sensors based vehicle tracking can be widely implemented in traffic surveillance and flow control. The vast development of video surveillance infrastructure in recent years has drawn the current research focus towards vehicle tracking using high-end and low cost optical sensors. However, tracking vehicles via such sensors could be challenging due to the high probability of changing vehi...
متن کاملMapReduce Particle Filtering with Exact Resampling and Deterministic Runtime
Particle filtering is a numerical Bayesian technique that has great potential for solving sequential estimation problems involving non-linear and non-Gaussian models. Since the estimation accuracy achieved by particle filters improves as the number of particles increases, it is natural to consider as many particles as possible. MapReduce is a generic programming model that makes it possible to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/mcsse2016/10951